public class Solution {
    public boolean Find(int target, int [][] array) {
        int i = 0, j = 0;
        int r = -1, d = -1;
        int len = array[0].length;
        if (target < array[i][j] || target > array[len - 1][len - 1]) return false;
        while (true) {
            if (i + 1 < len) {
                d = array[i + 1][j];
            }
            if (j + 1 < len) {
                r = array[i][j + 1];
            }
            int min = Math.min(r, d);
            int max = Math.max(r, d);
            
        }

        
    }
}
